Recognizability in the Simply Typed Lambda-Calculus
نویسنده
چکیده
We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite models. Using intersection types, we generalize the notions of automata for strings and trees so as to grasp recognizability for λ-terms. We then expose the closure properties of this notion and present some of its applications.
منابع مشابه
FREC delivrable 8: Algebraic classification of recognizable sets of λ-terms
This document constitutes the 8th deliverable of the FREC ANR project. So as to foster our understanding the nature of finite recognizability in the context of λY -calculus, this report presents the construction of a model that allows one to account for some computational properties of λY -terms: here namely the convergence of βδ-conversion. The computational properties of finite state models a...
متن کاملEmbedding developments into simply typed -calculus
By using an infinity of extra variables every λ-term with indexed redexes is interpreted into a term in the simply typed lambda calculus à la Curry. A development becomes a usual β-reduction in the simply typed lambda calculus and the corresponding properties of developments come out from the corresponding properties (strong normalization and Church-Rosser) holding in this system. In this way w...
متن کاملSimply Easy! An Implementation of a Dependently Typed Lambda Calculus
We present an implementation in Haskell of a dependently-typed lambda calculus that can be used as the core of a programming language. We show that a dependently-typed lambda calculus is no more difficult to implement than other typed lambda calculi. In fact, our implementation is almost as easy as an implementation of the simply typed lambda calculus, which we emphasize by discussing the modif...
متن کاملFrec Delivrable 4: Recognizability for Λ-terms
This document constitutes the delivrable 4 of the ANR project FREC. It describes the foundations of recognizability in the simply typed λ-calculus. It is divided in two parts: 1. the first part describes the notion, shows how it relates to the notions of rec-ognizability in free algebras and in free monoids. It also gives some examples of applications in the setting of λ-calculus by providing e...
متن کاملProof Systems for Retracts in Simply Typed Lambda Calculus
This paper concerns retracts in simply typed lambda calculus assuming βη-equality. We provide a simple tableau proof system which characterises when a type is a retract of another type and which leads to an exponential decision procedure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009